0.00/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.12/0.13	% Command    : eprover-ho %s --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers -auto-schedule -p --cpu-limit=%d --neg-ext=all --pos-ext=all --ext-sup-max-depth=2 --schedule-kind=CASC
0.13/0.34	% Computer   : n015.cluster.edu
0.13/0.34	% Model      : x86_64 x86_64
0.13/0.34	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.13/0.34	% Memory     : 8042.1875MB
0.13/0.34	% OS         : Linux 3.10.0-693.el7.x86_64
0.13/0.34	% CPULimit   : 1200
0.13/0.34	% WCLimit    : 120
0.13/0.34	% DateTime   : Tue Jul 13 11:30:49 EDT 2021
0.19/0.34	% CPUTime    : 
0.19/0.34	% Number of cores: 8
0.19/0.35	% Python version: Python 3.6.8
0.19/0.35	# Version: 2.6rc1-ho
0.19/0.35	# No SInE strategy applied
0.19/0.35	# Trying AutoSched0 for 59 seconds
4.37/4.61	# AutoSched0-Mode selected heuristic G_E___107_C37_SOS_F1_PI_AE_Q4_CS_SP_PS_S0Y
4.37/4.61	# and selection function SelectMaxLComplexAvoidPosPred.
4.37/4.61	#
4.37/4.61	# Preprocessing time       : 0.031 s
4.37/4.61	# Presaturation interreduction done
4.37/4.61	
4.37/4.61	# Proof found!
4.37/4.61	# SZS status Theorem
4.37/4.61	# SZS output start CNFRefutation
4.37/4.61	thf(ap_tp, axiom, ![X1:del, X2:del, X7:$i]:(![X4:$i]:(mem @ (ap @ X7 @ X4) @ X2<=mem @ X4 @ X1)<=mem @ X7 @ (arr @ X1 @ X2)), file('/export/starexec/sandbox2/benchmark/Axioms/ITP001/ITP001^2.ax', ap_tp)).
4.37/4.61	thf(lam_tp, axiom, ![X1:del, X2:del, X3:$i > $i]:(mem @ (lam @ X1 @ X3) @ (arr @ X1 @ X2)<=![X4:$i]:(mem @ X4 @ X1=>mem @ (X3 @ X4) @ X2)), file('/export/starexec/sandbox2/benchmark/Axioms/ITP001/ITP001^2.ax', lam_tp)).
4.37/4.61	thf(mem_c_2Epred__set_2EREST, axiom, ![X11:del]:mem @ (c_2Epred__set_2EREST @ X11) @ (arr @ (arr @ X11 @ bool) @ (arr @ X11 @ bool)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', mem_c_2Epred__set_2EREST)).
4.37/4.61	thf(conj_thm_2Epred__set_2EREST__SUBSET, conjecture, ![X11:del, X13:$i]:(p @ (ap @ (ap @ (c_2Epred__set_2ESUBSET @ X11) @ (ap @ (c_2Epred__set_2EREST @ X11) @ X13)) @ X13)<=mem @ X13 @ (arr @ X11 @ bool)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', conj_thm_2Epred__set_2EREST__SUBSET)).
4.37/4.61	thf(mem_c_2Epred__set_2EDELETE, axiom, ![X11:del]:mem @ (c_2Epred__set_2EDELETE @ X11) @ (arr @ (arr @ X11 @ bool) @ (arr @ X11 @ (arr @ X11 @ bool))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', mem_c_2Epred__set_2EDELETE)).
4.37/4.61	thf(mem_c_2Epred__set_2ESUBSET, axiom, ![X11:del]:mem @ (c_2Epred__set_2ESUBSET @ X11) @ (arr @ (arr @ X11 @ bool) @ (arr @ (arr @ X11 @ bool) @ bool)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', mem_c_2Epred__set_2ESUBSET)).
4.37/4.61	thf(ax_thm_2Epred__set_2ESUBSET__DEF, axiom, ![X11:del, X13:$i]:(mem @ X13 @ (arr @ X11 @ bool)=>![X17:$i]:(mem @ X17 @ (arr @ X11 @ bool)=>(p @ (ap @ (ap @ (c_2Epred__set_2ESUBSET @ X11) @ X13) @ X17)<=>![X18:$i]:((p @ (ap @ (ap @ (c_2Ebool_2EIN @ X11) @ X18) @ X17)<=p @ (ap @ (ap @ (c_2Ebool_2EIN @ X11) @ X18) @ X13))<=mem @ X18 @ X11)))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', ax_thm_2Epred__set_2ESUBSET__DEF)).
4.37/4.61	thf(stp_iso_mem_o, axiom, ![X4:$i]:(mem @ X4 @ bool=>(X4)=(inj__o @ (p @ X4))), file('/export/starexec/sandbox2/benchmark/Axioms/ITP001/ITP001^2.ax', stp_iso_mem_o)).
4.37/4.61	thf(conj_thm_2Epred__set_2EIN__DELETE, axiom, ![X11:del, X13:$i]:(mem @ X13 @ (arr @ X11 @ bool)=>![X15:$i]:(mem @ X15 @ X11=>![X16:$i]:(mem @ X16 @ X11=>(p @ (ap @ (ap @ (c_2Ebool_2EIN @ X11) @ X15) @ (ap @ (ap @ (c_2Epred__set_2EDELETE @ X11) @ X13) @ X16))<=>((X15)!=(X16)&p @ (ap @ (ap @ (c_2Ebool_2EIN @ X11) @ X15) @ X13)))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', conj_thm_2Epred__set_2EIN__DELETE)).
4.37/4.61	thf(mem_c_2Epred__set_2ECHOICE, axiom, ![X11:del]:mem @ (c_2Epred__set_2ECHOICE @ X11) @ (arr @ (arr @ X11 @ bool) @ X11), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', mem_c_2Epred__set_2ECHOICE)).
4.37/4.61	thf(beta, axiom, ![X1:del, X3:$i > $i, X4:$i]:(mem @ X4 @ X1=>(ap @ (lam @ X1 @ X3) @ X4)=(X3 @ X4)), file('/export/starexec/sandbox2/benchmark/Axioms/ITP001/ITP001^2.ax', beta)).
4.37/4.61	thf(ax_thm_2Epred__set_2EREST__DEF, axiom, ![X11:del, X13:$i]:(mem @ X13 @ (arr @ X11 @ bool)=>(ap @ (c_2Epred__set_2EREST @ X11) @ X13)=(ap @ (ap @ (c_2Epred__set_2EDELETE @ X11) @ X13) @ (ap @ (c_2Epred__set_2ECHOICE @ X11) @ X13))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', ax_thm_2Epred__set_2EREST__DEF)).
4.37/4.61	thf(stp_inj_surj_o, axiom, ![X5:$o]:(p @ (inj__o @ (X5))<=>X5), file('/export/starexec/sandbox2/benchmark/Axioms/ITP001/ITP001^2.ax', stp_inj_surj_o)).
4.37/4.61	thf(c_0_13, plain, ![X1:del, X2:del, X7:$i]:(mem @ X7 @ (arr @ X1 @ X2)=>![X4:$i]:(mem @ X4 @ X1=>mem @ (ap @ X7 @ X4) @ X2)), inference(fof_simplification,[status(thm)],[ap_tp])).
4.37/4.61	thf(c_0_14, plain, ![X1:del, X2:del, X3:$i > $i]:(![X4:$i]:(mem @ X4 @ X1=>mem @ (X3 @ X4) @ X2)=>mem @ (lam @ X1 @ X3) @ (arr @ X1 @ X2)), inference(fof_simplification,[status(thm)],[lam_tp])).
4.37/4.61	thf(c_0_15, plain, ![X77:del, X78:del, X79:$i, X80:$i]:(~mem @ X79 @ (arr @ X77 @ X78)|(~mem @ X80 @ X77|mem @ (ap @ X79 @ X80) @ X78)), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])])).
4.37/4.61	thf(c_0_16, plain, ![X109:del]:mem @ (c_2Epred__set_2EREST @ X109) @ (arr @ (arr @ X109 @ bool) @ (arr @ X109 @ bool)), inference(variable_rename,[status(thm)],[mem_c_2Epred__set_2EREST])).
4.37/4.61	thf(c_0_17, plain, ![X68:del, X69:del, X70:$i > $i]:((mem @ (esk1_3 @ X68 @ X69 @ X70) @ X68|mem @ (lam @ X68 @ X70) @ (arr @ X68 @ X69))&(~mem @ (X70 @ (esk1_3 @ X68 @ X69 @ X70)) @ X69|mem @ (lam @ X68 @ X70) @ (arr @ X68 @ X69))), inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])])])).
4.37/4.61	thf(c_0_18, negated_conjecture, ~(![X11:del, X13:$i]:(mem @ X13 @ (arr @ X11 @ bool)=>p @ (ap @ (ap @ (c_2Epred__set_2ESUBSET @ X11) @ (ap @ (c_2Epred__set_2EREST @ X11) @ X13)) @ X13))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_thm_2Epred__set_2EREST__SUBSET])])).
4.37/4.61	thf(c_0_19, plain, ![X2:del, X7:$i, X4:$i, X1:del]:(mem @ (ap @ X4 @ X7) @ X2|~mem @ X4 @ (arr @ X1 @ X2)|~mem @ X7 @ X1), inference(split_conjunct,[status(thm)],[c_0_15])).
4.37/4.61	thf(c_0_20, plain, ![X1:del]:mem @ (c_2Epred__set_2EREST @ X1) @ (arr @ (arr @ X1 @ bool) @ (arr @ X1 @ bool)), inference(split_conjunct,[status(thm)],[c_0_16])).
4.37/4.61	thf(c_0_21, plain, ![X3:$i > $i, X1:del, X2:del]:(mem @ (esk1_3 @ X1 @ X2 @ X3) @ X1|mem @ (lam @ X1 @ X3) @ (arr @ X1 @ X2)), inference(split_conjunct,[status(thm)],[c_0_17])).
4.37/4.61	thf(c_0_22, negated_conjecture, (mem @ esk5_0 @ (arr @ esk4_0 @ bool)&~p @ (ap @ (ap @ (c_2Epred__set_2ESUBSET @ esk4_0) @ (ap @ (c_2Epred__set_2EREST @ esk4_0) @ esk5_0)) @ esk5_0)), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_18])])])).
4.37/4.61	thf(c_0_23, plain, ![X115:del]:mem @ (c_2Epred__set_2EDELETE @ X115) @ (arr @ (arr @ X115 @ bool) @ (arr @ X115 @ (arr @ X115 @ bool))), inference(variable_rename,[status(thm)],[mem_c_2Epred__set_2EDELETE])).
4.37/4.61	thf(c_0_24, plain, ![X90:del]:mem @ (c_2Epred__set_2ESUBSET @ X90) @ (arr @ (arr @ X90 @ bool) @ (arr @ (arr @ X90 @ bool) @ bool)), inference(variable_rename,[status(thm)],[mem_c_2Epred__set_2ESUBSET])).
4.37/4.61	thf(c_0_25, plain, ![X3:$i > $i, X1:del, X2:del]:(mem @ (lam @ X1 @ X3) @ (arr @ X1 @ X2)|~mem @ (X3 @ (esk1_3 @ X1 @ X2 @ X3)) @ X2), inference(split_conjunct,[status(thm)],[c_0_17])).
4.37/4.61	thf(c_0_26, plain, ![X4:$i, X1:del]:(mem @ (ap @ (c_2Epred__set_2EREST @ X1) @ X4) @ (arr @ X1 @ bool)|~mem @ X4 @ (arr @ X1 @ bool)), inference(spm,[status(thm)],[c_0_19, c_0_20])).
4.37/4.61	thf(c_0_27, plain, ![X3:$i > $i, X4:$i, X2:del, X1:del]:(mem @ (ap @ (lam @ X1 @ X3) @ X4) @ X2|mem @ (esk1_3 @ X1 @ X2 @ X3) @ X1|~mem @ X4 @ X1), inference(spm,[status(thm)],[c_0_19, c_0_21])).
4.37/4.61	thf(c_0_28, negated_conjecture, mem @ esk5_0 @ (arr @ esk4_0 @ bool), inference(split_conjunct,[status(thm)],[c_0_22])).
4.37/4.61	thf(c_0_29, plain, ![X11:del, X13:$i]:(mem @ X13 @ (arr @ X11 @ bool)=>![X17:$i]:(mem @ X17 @ (arr @ X11 @ bool)=>(p @ (ap @ (ap @ (c_2Epred__set_2ESUBSET @ X11) @ X13) @ X17)<=>![X18:$i]:(mem @ X18 @ X11=>(p @ (ap @ (ap @ (c_2Ebool_2EIN @ X11) @ X18) @ X13)=>p @ (ap @ (ap @ (c_2Ebool_2EIN @ X11) @ X18) @ X17)))))), inference(fof_simplification,[status(thm)],[ax_thm_2Epred__set_2ESUBSET__DEF])).
4.37/4.61	thf(c_0_30, plain, ![X1:del]:mem @ (c_2Epred__set_2EDELETE @ X1) @ (arr @ (arr @ X1 @ bool) @ (arr @ X1 @ (arr @ X1 @ bool))), inference(split_conjunct,[status(thm)],[c_0_23])).
4.37/4.61	thf(c_0_31, axiom, ![X4:$i]:(mem @ X4 @ bool=>((~p @ X4|(X4)=(inj__o @ $true))&(p @ X4|(X4)=(inj__o @ $false)))), inference(fool_unroll,[status(thm)],[stp_iso_mem_o])).
4.37/4.61	thf(c_0_32, plain, ![X1:del]:mem @ (c_2Epred__set_2ESUBSET @ X1) @ (arr @ (arr @ X1 @ bool) @ (arr @ (arr @ X1 @ bool) @ bool)), inference(split_conjunct,[status(thm)],[c_0_24])).
4.37/4.61	thf(c_0_33, plain, ![X1:del, X2:del]:(mem @ (lam @ X1 @ (ap @ (c_2Epred__set_2EREST @ X2))) @ (arr @ X1 @ (arr @ X2 @ bool))|~mem @ (esk1_3 @ X1 @ (arr @ X2 @ bool) @ (ap @ (c_2Epred__set_2EREST @ X2))) @ (arr @ X2 @ bool)), inference(spm,[status(thm)],[c_0_25, c_0_26])).
4.37/4.61	thf(c_0_34, negated_conjecture, ![X3:$i > $i, X1:del]:(mem @ (esk1_3 @ (arr @ esk4_0 @ bool) @ X1 @ X3) @ (arr @ esk4_0 @ bool)|mem @ (ap @ (lam @ (arr @ esk4_0 @ bool) @ X3) @ esk5_0) @ X1), inference(spm,[status(thm)],[c_0_27, c_0_28])).
4.37/4.61	thf(c_0_35, plain, ![X102:del, X103:$i, X104:$i, X105:$i]:((((X104)!=(X105)|~p @ (ap @ (ap @ (c_2Ebool_2EIN @ X102) @ X104) @ (ap @ (ap @ (c_2Epred__set_2EDELETE @ X102) @ X103) @ X105))|~mem @ X105 @ X102|~mem @ X104 @ X102|~mem @ X103 @ (arr @ X102 @ bool))&(p @ (ap @ (ap @ (c_2Ebool_2EIN @ X102) @ X104) @ X103)|~p @ (ap @ (ap @ (c_2Ebool_2EIN @ X102) @ X104) @ (ap @ (ap @ (c_2Epred__set_2EDELETE @ X102) @ X103) @ X105))|~mem @ X105 @ X102|~mem @ X104 @ X102|~mem @ X103 @ (arr @ X102 @ bool)))&((X104)=(X105)|~p @ (ap @ (ap @ (c_2Ebool_2EIN @ X102) @ X104) @ X103)|p @ (ap @ (ap @ (c_2Ebool_2EIN @ X102) @ X104) @ (ap @ (ap @ (c_2Epred__set_2EDELETE @ X102) @ X103) @ X105))|~mem @ X105 @ X102|~mem @ X104 @ X102|~mem @ X103 @ (arr @ X102 @ bool))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[conj_thm_2Epred__set_2EIN__DELETE])])])])).
4.37/4.61	thf(c_0_36, plain, ![X110:del, X111:$i, X112:$i, X113:$i]:((~p @ (ap @ (ap @ (c_2Epred__set_2ESUBSET @ X110) @ X111) @ X112)|(~mem @ X113 @ X110|(~p @ (ap @ (ap @ (c_2Ebool_2EIN @ X110) @ X113) @ X111)|p @ (ap @ (ap @ (c_2Ebool_2EIN @ X110) @ X113) @ X112)))|~mem @ X112 @ (arr @ X110 @ bool)|~mem @ X111 @ (arr @ X110 @ bool))&((mem @ (esk6_3 @ X110 @ X111 @ X112) @ X110|p @ (ap @ (ap @ (c_2Epred__set_2ESUBSET @ X110) @ X111) @ X112)|~mem @ X112 @ (arr @ X110 @ bool)|~mem @ X111 @ (arr @ X110 @ bool))&((p @ (ap @ (ap @ (c_2Ebool_2EIN @ X110) @ (esk6_3 @ X110 @ X111 @ X112)) @ X111)|p @ (ap @ (ap @ (c_2Epred__set_2ESUBSET @ X110) @ X111) @ X112)|~mem @ X112 @ (arr @ X110 @ bool)|~mem @ X111 @ (arr @ X110 @ bool))&(~p @ (ap @ (ap @ (c_2Ebool_2EIN @ X110) @ (esk6_3 @ X110 @ X111 @ X112)) @ X112)|p @ (ap @ (ap @ (c_2Epred__set_2ESUBSET @ X110) @ X111) @ X112)|~mem @ X112 @ (arr @ X110 @ bool)|~mem @ X111 @ (arr @ X110 @ bool))))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_29])])])])])).
4.37/4.61	thf(c_0_37, plain, ![X4:$i, X1:del]:(mem @ (ap @ (c_2Epred__set_2EDELETE @ X1) @ X4) @ (arr @ X1 @ (arr @ X1 @ bool))|~mem @ X4 @ (arr @ X1 @ bool)), inference(spm,[status(thm)],[c_0_19, c_0_30])).
4.37/4.61	thf(c_0_38, plain, ![X81:$i]:((~p @ X81|(X81)=(inj__o @ $true)|~mem @ X81 @ bool)&(p @ X81|(X81)=(inj__o @ $false)|~mem @ X81 @ bool)), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_31])])])).
4.37/4.61	thf(c_0_39, plain, ![X4:$i, X1:del]:(mem @ (ap @ (c_2Epred__set_2ESUBSET @ X1) @ X4) @ (arr @ (arr @ X1 @ bool) @ bool)|~mem @ X4 @ (arr @ X1 @ bool)), inference(spm,[status(thm)],[c_0_19, c_0_32])).
4.37/4.61	thf(c_0_40, negated_conjecture, (mem @ (lam @ (arr @ esk4_0 @ bool) @ (ap @ (c_2Epred__set_2EREST @ esk4_0))) @ (arr @ (arr @ esk4_0 @ bool) @ (arr @ esk4_0 @ bool))|mem @ (ap @ (lam @ (arr @ esk4_0 @ bool) @ (ap @ (c_2Epred__set_2EREST @ esk4_0))) @ esk5_0) @ (arr @ esk4_0 @ bool)), inference(spm,[status(thm)],[c_0_33, c_0_34])).
4.37/4.61	thf(c_0_41, plain, ![X8:$i, X7:$i, X4:$i, X1:del]:(p @ (ap @ (ap @ (c_2Ebool_2EIN @ X1) @ X4) @ X7)|~p @ (ap @ (ap @ (c_2Ebool_2EIN @ X1) @ X4) @ (ap @ (ap @ (c_2Epred__set_2EDELETE @ X1) @ X7) @ X8))|~mem @ X8 @ X1|~mem @ X4 @ X1|~mem @ X7 @ (arr @ X1 @ bool)), inference(split_conjunct,[status(thm)],[c_0_35])).
4.37/4.61	thf(c_0_42, plain, ![X7:$i, X4:$i, X1:del]:(p @ (ap @ (ap @ (c_2Ebool_2EIN @ X1) @ (esk6_3 @ X1 @ X4 @ X7)) @ X4)|p @ (ap @ (ap @ (c_2Epred__set_2ESUBSET @ X1) @ X4) @ X7)|~mem @ X7 @ (arr @ X1 @ bool)|~mem @ X4 @ (arr @ X1 @ bool)), inference(split_conjunct,[status(thm)],[c_0_36])).
4.37/4.61	thf(c_0_43, plain, ![X7:$i, X4:$i, X1:del]:(mem @ (ap @ (ap @ (c_2Epred__set_2EDELETE @ X1) @ X4) @ X7) @ (arr @ X1 @ bool)|~mem @ X4 @ (arr @ X1 @ bool)|~mem @ X7 @ X1), inference(spm,[status(thm)],[c_0_19, c_0_37])).
4.37/4.61	thf(c_0_44, plain, ![X97:del]:mem @ (c_2Epred__set_2ECHOICE @ X97) @ (arr @ (arr @ X97 @ bool) @ X97), inference(variable_rename,[status(thm)],[mem_c_2Epred__set_2ECHOICE])).
4.37/4.61	thf(c_0_45, plain, ![X4:$i]:(p @ X4|(X4)=(inj__o @ $false)|~mem @ X4 @ bool), inference(split_conjunct,[status(thm)],[c_0_38])).
4.37/4.61	thf(c_0_46, plain, ![X7:$i, X4:$i, X1:del]:(mem @ (ap @ (ap @ (c_2Epred__set_2ESUBSET @ X1) @ X4) @ X7) @ bool|~mem @ X7 @ (arr @ X1 @ bool)|~mem @ X4 @ (arr @ X1 @ bool)), inference(spm,[status(thm)],[c_0_19, c_0_39])).
4.37/4.61	thf(c_0_47, negated_conjecture, ![X4:$i]:(mem @ (ap @ (lam @ (arr @ esk4_0 @ bool) @ (ap @ (c_2Epred__set_2EREST @ esk4_0))) @ esk5_0) @ (arr @ esk4_0 @ bool)|mem @ (ap @ (lam @ (arr @ esk4_0 @ bool) @ (ap @ (c_2Epred__set_2EREST @ esk4_0))) @ X4) @ (arr @ esk4_0 @ bool)|~mem @ X4 @ (arr @ esk4_0 @ bool)), inference(spm,[status(thm)],[c_0_19, c_0_40])).
4.37/4.61	thf(c_0_48, plain, ![X72:del, X73:$i > $i, X74:$i]:(~mem @ X74 @ X72|(ap @ (lam @ X72 @ X73) @ X74)=(X73 @ X74)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[beta])])).
4.37/4.61	thf(c_0_49, plain, ![X7:$i, X4:$i, X1:del]:(p @ (ap @ (ap @ (c_2Epred__set_2ESUBSET @ X1) @ X4) @ X7)|~p @ (ap @ (ap @ (c_2Ebool_2EIN @ X1) @ (esk6_3 @ X1 @ X4 @ X7)) @ X7)|~mem @ X7 @ (arr @ X1 @ bool)|~mem @ X4 @ (arr @ X1 @ bool)), inference(split_conjunct,[status(thm)],[c_0_36])).
4.37/4.61	thf(c_0_50, plain, ![X8:$i, X7:$i, X4:$i, X1:del]:(p @ (ap @ (ap @ (c_2Ebool_2EIN @ X1) @ (esk6_3 @ X1 @ (ap @ (ap @ (c_2Epred__set_2EDELETE @ X1) @ X4) @ X7) @ X8)) @ X4)|p @ (ap @ (ap @ (c_2Epred__set_2ESUBSET @ X1) @ (ap @ (ap @ (c_2Epred__set_2EDELETE @ X1) @ X4) @ X7)) @ X8)|~mem @ (esk6_3 @ X1 @ (ap @ (ap @ (c_2Epred__set_2EDELETE @ X1) @ X4) @ X7) @ X8) @ X1|~mem @ X4 @ (arr @ X1 @ bool)|~mem @ X8 @ (arr @ X1 @ bool)|~mem @ X7 @ X1), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_41, c_0_42]), c_0_43])).
4.37/4.61	thf(c_0_51, plain, ![X7:$i, X4:$i, X1:del]:(mem @ (esk6_3 @ X1 @ X4 @ X7) @ X1|p @ (ap @ (ap @ (c_2Epred__set_2ESUBSET @ X1) @ X4) @ X7)|~mem @ X7 @ (arr @ X1 @ bool)|~mem @ X4 @ (arr @ X1 @ bool)), inference(split_conjunct,[status(thm)],[c_0_36])).
4.37/4.61	thf(c_0_52, plain, ![X100:del, X101:$i]:(~mem @ X101 @ (arr @ X100 @ bool)|(ap @ (c_2Epred__set_2EREST @ X100) @ X101)=(ap @ (ap @ (c_2Epred__set_2EDELETE @ X100) @ X101) @ (ap @ (c_2Epred__set_2ECHOICE @ X100) @ X101))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax_thm_2Epred__set_2EREST__DEF])])).
4.37/4.61	thf(c_0_53, plain, ![X1:del]:mem @ (c_2Epred__set_2ECHOICE @ X1) @ (arr @ (arr @ X1 @ bool) @ X1), inference(split_conjunct,[status(thm)],[c_0_44])).
4.37/4.61	thf(c_0_54, negated_conjecture, ~p @ (ap @ (ap @ (c_2Epred__set_2ESUBSET @ esk4_0) @ (ap @ (c_2Epred__set_2EREST @ esk4_0) @ esk5_0)) @ esk5_0), inference(split_conjunct,[status(thm)],[c_0_22])).
4.37/4.61	thf(c_0_55, plain, ![X7:$i, X4:$i, X1:del]:((ap @ (ap @ (c_2Epred__set_2ESUBSET @ X1) @ X4) @ X7)=(inj__o @ $false)|p @ (ap @ (ap @ (c_2Epred__set_2ESUBSET @ X1) @ X4) @ X7)|~mem @ X7 @ (arr @ X1 @ bool)|~mem @ X4 @ (arr @ X1 @ bool)), inference(spm,[status(thm)],[c_0_45, c_0_46])).
4.37/4.61	thf(c_0_56, negated_conjecture, mem @ (ap @ (lam @ (arr @ esk4_0 @ bool) @ (ap @ (c_2Epred__set_2EREST @ esk4_0))) @ esk5_0) @ (arr @ esk4_0 @ bool), inference(spm,[status(thm)],[c_0_47, c_0_28])).
4.37/4.61	thf(c_0_57, plain, ![X3:$i > $i, X4:$i, X1:del]:((ap @ (lam @ X1 @ X3) @ X4)=(X3 @ X4)|~mem @ X4 @ X1), inference(split_conjunct,[status(thm)],[c_0_48])).
4.37/4.61	thf(c_0_58, axiom, ![X5:$o]:(((~X5|p @ (inj__o @ $true))&(X5|p @ (inj__o @ $false)))<=>X5), inference(fool_unroll,[status(thm)],[stp_inj_surj_o])).
4.37/4.61	thf(c_0_59, plain, ![X7:$i, X4:$i, X1:del]:(p @ (ap @ (ap @ (c_2Epred__set_2ESUBSET @ X1) @ (ap @ (ap @ (c_2Epred__set_2EDELETE @ X1) @ X4) @ X7)) @ X4)|~mem @ X4 @ (arr @ X1 @ bool)|~mem @ X7 @ X1), inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_49, c_0_50]), c_0_51]), c_0_43])).
4.37/4.61	thf(c_0_60, plain, ![X4:$i, X1:del]:((ap @ (c_2Epred__set_2EREST @ X1) @ X4)=(ap @ (ap @ (c_2Epred__set_2EDELETE @ X1) @ X4) @ (ap @ (c_2Epred__set_2ECHOICE @ X1) @ X4))|~mem @ X4 @ (arr @ X1 @ bool)), inference(split_conjunct,[status(thm)],[c_0_52])).
4.37/4.61	thf(c_0_61, plain, ![X4:$i, X1:del]:(mem @ (ap @ (c_2Epred__set_2ECHOICE @ X1) @ X4) @ X1|~mem @ X4 @ (arr @ X1 @ bool)), inference(spm,[status(thm)],[c_0_19, c_0_53])).
4.37/4.61	thf(c_0_62, negated_conjecture, ((ap @ (ap @ (c_2Epred__set_2ESUBSET @ esk4_0) @ (ap @ (c_2Epred__set_2EREST @ esk4_0) @ esk5_0)) @ esk5_0)=(inj__o @ $false)|~mem @ (ap @ (c_2Epred__set_2EREST @ esk4_0) @ esk5_0) @ (arr @ esk4_0 @ bool)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54, c_0_55]), c_0_28])])).
4.37/4.61	thf(c_0_63, negated_conjecture, mem @ (ap @ (c_2Epred__set_2EREST @ esk4_0) @ esk5_0) @ (arr @ esk4_0 @ bool), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56, c_0_57]), c_0_28])])).
4.37/4.61	thf(c_0_64, plain, ![X75:$o]:((((~X75|X75|X75)&(~p @ (inj__o @ $false)|X75|X75))&((~X75|~p @ (inj__o @ $true)|X75)&(~p @ (inj__o @ $false)|~p @ (inj__o @ $true)|X75)))&((~X75|p @ (inj__o @ $true)|~X75)&(X75|p @ (inj__o @ $false)|~X75))), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_58])])])).
4.37/4.61	thf(c_0_65, plain, ![X4:$i, X1:del]:(p @ (ap @ (ap @ (c_2Epred__set_2ESUBSET @ X1) @ (ap @ (c_2Epred__set_2EREST @ X1) @ X4)) @ X4)|~mem @ X4 @ (arr @ X1 @ bool)), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_59, c_0_60]), c_0_61])).
4.37/4.61	thf(c_0_66, negated_conjecture, (ap @ (ap @ (c_2Epred__set_2ESUBSET @ esk4_0) @ (ap @ (c_2Epred__set_2EREST @ esk4_0) @ esk5_0)) @ esk5_0)=(inj__o @ $false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_62, c_0_63])])).
4.37/4.61	thf(c_0_67, plain, ~p @ (inj__o @ $false), inference(eliminate_boolean_vars,[status(thm)],[inference(cn,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_64])])])).
4.37/4.61	thf(c_0_68, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65, c_0_66]), c_0_28])]), c_0_67]), ['proof']).
4.37/4.61	# SZS output end CNFRefutation
4.37/4.61	# Proof object total steps             : 69
4.37/4.61	# Proof object clause steps            : 37
4.37/4.61	# Proof object formula steps           : 32
4.37/4.61	# Proof object conjectures             : 13
4.37/4.61	# Proof object clause conjectures      : 10
4.37/4.61	# Proof object formula conjectures     : 3
4.37/4.61	# Proof object initial clauses used    : 17
4.37/4.61	# Proof object initial formulas used   : 13
4.37/4.61	# Proof object generating inferences   : 19
4.37/4.61	# Proof object simplifying inferences  : 14
4.37/4.61	# Training examples: 0 positive, 0 negative
4.37/4.61	# Parsed axioms                        : 45
4.37/4.61	# Removed by relevancy pruning/SinE    : 0
4.37/4.61	# Initial clauses                      : 68
4.37/4.61	# Removed in clause preprocessing      : 22
4.37/4.61	# Initial clauses in saturation        : 46
4.37/4.61	# Processed clauses                    : 5694
4.37/4.61	# ...of these trivial                  : 3
4.37/4.61	# ...subsumed                          : 3145
4.37/4.61	# ...remaining for further processing  : 2546
4.37/4.61	# Other redundant clauses eliminated   : 149
4.37/4.61	# Clauses deleted for lack of memory   : 0
4.37/4.61	# Backward-subsumed                    : 176
4.37/4.61	# Backward-rewritten                   : 34
4.37/4.61	# Generated clauses                    : 363336
4.37/4.61	# ...of the previous two non-trivial   : 353260
4.37/4.61	# Contextual simplify-reflections      : 95
4.37/4.61	# Paramodulations                      : 362836
4.37/4.61	# Factorizations                       : 139
4.37/4.61	# NegExts                              : 6
4.37/4.61	# Equation resolutions                 : 150
4.37/4.61	# Propositional unsat checks           : 0
4.37/4.61	#    Propositional check models        : 0
4.37/4.61	#    Propositional check unsatisfiable : 0
4.37/4.61	#    Propositional clauses             : 0
4.37/4.61	#    Propositional clauses after purity: 0
4.37/4.61	#    Propositional unsat core size     : 0
4.37/4.61	#    Propositional preprocessing time  : 0.000
4.37/4.61	#    Propositional encoding time       : 0.000
4.37/4.61	#    Propositional solver time         : 0.000
4.37/4.61	#    Success case prop preproc time    : 0.000
4.37/4.61	#    Success case prop encoding time   : 0.000
4.37/4.61	#    Success case prop solver time     : 0.000
4.37/4.61	# Current number of processed clauses  : 2289
4.37/4.61	#    Positive orientable unit clauses  : 34
4.37/4.61	#    Positive unorientable unit clauses: 0
4.37/4.61	#    Negative unit clauses             : 2
4.37/4.61	#    Non-unit-clauses                  : 2253
4.37/4.61	# Current number of unprocessed clauses: 346772
4.37/4.61	# ...number of literals in the above   : 1646451
4.37/4.61	# Current number of archived formulas  : 0
4.37/4.61	# Current number of archived clauses   : 255
4.37/4.61	# Clause-clause subsumption calls (NU) : 599848
4.37/4.61	# Rec. Clause-clause subsumption calls : 127271
4.37/4.61	# Non-unit clause-clause subsumptions  : 2432
4.37/4.61	# Unit Clause-clause subsumption calls : 3616
4.37/4.61	# Rewrite failures with RHS unbound    : 0
4.37/4.61	# BW rewrite match attempts            : 38
4.37/4.61	# BW rewrite match successes           : 15
4.37/4.61	# Condensation attempts                : 0
4.37/4.61	# Condensation successes               : 0
4.37/4.61	# Termbank termtop insertions          : 13367061
4.37/4.63	
4.37/4.63	# -------------------------------------------------
4.37/4.63	# User time                : 4.111 s
4.37/4.63	# System time              : 0.167 s
4.37/4.63	# Total time               : 4.279 s
4.37/4.63	# Maximum resident set size: 1712 pages
4.37/4.63	EOF